Section: New Software and Platforms

The veriT Solver

Scientific Description

veriT comprises a SAT solver, a congruence closure based decision procedure for uninterpreted symbols, a simplex-based decision procedure for linear arithmetic, and instantiation-based quantifier handling.

Functional Description

VeriT is an open, trustable and efficient SMT (Satisfiability Modulo Theories) solver, featuring efficient decision procedure for uninterpreted symbols and linear arithmetic, and quantifier reasoning.

Efforts in 2016 have been focused on non-linear arithmetic reasoning and quantifier handling. The reasoning capabilities of veriT have been significantly improved along those two axes, but non-linear arithmetic reasoning is not yet stable.

The veriT solver participated in the SMT competition SMT-COMP 2016 with good results.

We target applications where validation of formulas is crucial, such as the validation of TLA⁺ and B specifications, and work together with the developers of the respective verification platforms to make veriT even more useful in practice. The solver is available as a plugin for the Rodin platform, it is integrated within the Atelier B.

• Participants: Pascal Fontaine, David Déharbe and Haniel Barbosa

• Partners: Université de Lorraine - Federal University of Rio Grande do Norte

• Contact: Pascal Fontaine

• URL: http://www.veriT-solver.org